Bike sharing systems: Solving the static rebalancing problem

This paper deals with a new problem that is a generalization of the many to many pickup and delivery problem and which is motivated by operating self-service bike sharing systems. There is only one commodity, initially distributed among the vertices of a graph, and a capacitated single vehicle aims to redistribute the commodity in order to reach a target distribution. Each vertex can be visited several times and also can be used as a bu er in which the commodity is stored for a later visit. This problem is NP-hard, since it contains several NP-hard problems as special case (the TSP being maybe the most obvious one). Even nding a tractable exact formulation remains problematic. This paper presents e cient algorithms for solving instances of reasonable size, and contains several theoretical results related to these algorithms. A branch-and-cut algorithm is proposed for solving a relaxation of the problem. An upper bound of the optimal solution of the problem is obtained by a tabu search, which is based on some theoretical properties of the solution, once xed the sequence of the visited vertices. The possibility of using the information provided by the relaxation receives a special attention, both from a theoretical and practical point of view. It is proved that to build a feasible solution of the problem by using the one obtained by the relaxation is an NP-hard problem. Nevertheless, a tabu search initialized with the optimal solution of the relaxation often shows that it is the optimal one. The algorithms have been tested on a set of instances coming from the literature, proving their e ectiveness.